منابع مشابه
Universal Learning Theory
This encyclopedic article gives a mini-introduction into the theory of universal learning, founded by Ray Solomonoff in the 1960s and significantly developed and extended in the last decade. It explains the spirit of universal learning, but necessarily glosses over technical subtleties.
متن کاملStatistical Learning Theory Lecture : 27 Universal Portfolios
Suppose we have m instruments (i.e. stocks). At each period of time t, we have wealth Vt, and we invest a proportion pt,i in each instrument i. Instrument i increases in value by a factor xt,i ≥ 0. Our capital at period t thus increases by a factor Vt Vt−1 = ∑ i xt,ipt,i = x ′ tpt. pt is in the simplex ∆m, and xt is a random m-dimensional vector. The first question to consider is: what is a fai...
متن کاملUniversal Algorithms for Learning Theory Part I : Piecewise Constant Functions
This paper is concerned with the construction and analysis of a universal estimator for the regression problem in supervised learning. Universal means that the estimator does not depend on any a priori assumptions about the regression function to be estimated. The universal estimator studied in this paper consists of a least-square fitting procedure using piecewise constant functions on a parti...
متن کاملUniversal algorithms for learning theory Part II : piecewise polynomial functions
This paper is concerned with estimating the regression function fρ in supervised learning by utilizing piecewise polynomial approximations on adaptively generated partitions. The main point of interest is algorithms that with high probability are optimal in terms of the least square error achieved for a given number m of observed data. In a previous paper [1], we have developed for each β > 0 a...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 1996
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.116.7_794